-
1 алгоритмический элемент
алгоритмический элемент
Элемент, представляющий алгоритм выполнения функции управляющего объекта или объекта управления.
[Сборник рекомендуемых терминов. Выпуск 107. Теория управления.
Академия наук СССР. Комитет научно-технической терминологии. 1984 г.]Тематики
- автоматизация, основные понятия
Обобщающие термины
EN
Русско-английский словарь нормативно-технической терминологии > алгоритмический элемент
См. также в других словарях:
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
Element uniqueness problem — The element uniqueness problem is a fundamental problem in computational complexity theory, being a problem for which a direct proof exists [ [http://ru linux geek.livejournal.com/35523.html A proof I will never forget: An algorithms story] ]… … Wikipedia
Quantum mind — theories are based on the premise that quantum mechanics is necessary to fully understand the mind and brain, particularly concerning an explanation of consciousness. This approach is considered a minority opinion in science, although it does… … Wikipedia
алгоритмический элемент — Элемент, представляющий алгоритм выполнения функции управляющего объекта или объекта управления. [Сборник рекомендуемых терминов. Выпуск 107. Теория управления. Академия наук СССР. Комитет научно технической терминологии. 1984 г.] Тематики… … Справочник технического переводчика
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
ALGOL — This article is about the programming language family. For other uses, see Algol (disambiguation). ALGOL Paradigm(s) procedural, imperative, structured Appeared in 1958 Designed by Bauer, Bottenbruch, Rutishauser, Samelson, Backus, Katz, Perlis … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
Word (group theory) — In group theory, a word is any written product of group elements and their inverses. For example, if x , y , and z are elements of a group G , then xy , z 1 xzz , and y 1 zxx 1 yz 1 are words in the set { x , y , z }. Words play an important role … Wikipedia
computer programming language — Introduction any of various languages for expressing a set of detailed instructions for a digital computer. Such instructions can be executed directly when they are in the computer manufacturer specific numerical form known as machine… … Universalium